combinatorial closure

См. также в других словарях:

• Matroid — In combinatorics, a branch of mathematics, a matroid (  /ˈmeɪ …   Wikipedia

• List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

• Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …   Wikipedia

• Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three …   Wikipedia

• Pregeometry (model theory) — Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for matroid . They were introduced by G. C. Rota with the intention of providing a less ineffably cacaphonous alternative term. Also, the term combinatorial geometry,… …   Wikipedia

• Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… …   Wikipedia

• Kazhdan–Lusztig polynomial — In representation theory, a Kazhdan–Lusztig polynomial P y,w ( q ) is a member of a family of integral polynomials introduced in work of David Kazhdan and George Lusztig Harv|Kazhdan|Lusztig|1979. They are indexed by pairs of elements y , w of a… …   Wikipedia

• Van Kampen diagram — In the mathematical area of geometric group theory, a van Kampen diagram is a planar diagram used to represent the fact that a particular word among the generators of a group given by a group presentation represents the identity element in that… …   Wikipedia

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• Surreal number — In mathematics, the surreal number system is an arithmetic continuum containing the real numbers as well as infinite and infinitesimal numbers, respectively larger or smaller in absolute value than any positive real number. The surreals share… …   Wikipedia

• CW complex — In topology, a CW complex is a type of topological space introduced by J. H. C. Whitehead to meet the needs of homotopy theory. This class of spaces is broader and has some better categorical properties than simplicial complexes, but still… …   Wikipedia